NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
321	The Community-search Problem and How to Plan a Successful Cocktail Party ∗ Mauro Sozio Add to Reading List Source URL: research.yahoo.com Language: English - Date: 2013-04-05 04:39:54 NP-complete problems Graph operations Graph coloring Dense subgraph Graph partition Community structure Tree Shortest path problem Graph Graph theory Theoretical computer science Mathematics
322	Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions Add to Reading List Source URL: cognitiveharmony.net Language: English - Date: 2008-09-30 17:00:23 Complexity classes NP-hard NP-complete NP P versus NP problem P Reduction Decision problem Oracle machine Theoretical computer science Computational complexity theory Applied mathematics
323	Sage Reference Manual: Graph Theory Release 6.7 The Sage Development Team June 24, 2015 Add to Reading List Source URL: doc.sagemath.org Language: English - Date: 2015-06-24 05:21:38 Graph Neighbourhood Adjacency matrix Line graph Directed acyclic graph Hamiltonian path Eulerian path Tree Independent set Graph theory Mathematics NP-complete problems
324	Syntax-Guided Synthesis Rajeev ALUR a , Rastislav BODIK b , Eric DALLAL c , Dana FISMAN a , Pranav GARG d , Garvit JUNIWAL b , Hadas KRESS-GAZIT e , P. MADHUSUDAN d , Milo M. K. MARTIN a , Mukund RAGHOTHAMAN a , Shamwadi Add to Reading List Source URL: sygus.seas.upenn.edu Language: English - Date: 2015-01-10 00:32:21 Predicate logic Theoretical computer science Formal methods NP-complete problems First-order logic Satisfiability Modulo Theories Expression Type system Function Mathematics Logic Mathematical logic
325	c 2005 Society for Industrial and Applied Mathematics SIAM J. COMPUT. Vol. 34, No. 6, pp. 1331–1351 Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2009-09-24 16:08:59 Analysis of algorithms NP-complete problems Set cover problem Randomized algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
326	GMMCP Tracker: Globally Optimal Generalized Maximum Multi Clique Problem for Multiple Object Tracking Afshin Dehghan Shayan Modiri Assari Mubarak Shah Center for Research in Computer Vision, University of Central Florida Add to Reading List Source URL: crcv.ucf.edu Language: English - Date: 2015-04-13 12:15:56 Clique problem Clique Graph operations Networks Tree decomposition Decomposition method Graph theory Theoretical computer science NP-complete problems
327	A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4\|E(G)\| − \|V (G Add to Reading List Source URL: www.pkoms.com Language: English - Date: 2011-12-29 23:15:14 Matroid theory Polynomials Tutte polynomial Degree Tree NP-complete problems Path decomposition Handshaking lemma Graph theory Mathematics Theoretical computer science
328	Improved Bound for the Union of Fat Triangles∗ Esther Ezra† Boris Aronov‡ Abstract Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2010-10-14 21:45:02 Analysis of algorithms Computational geometry NP-complete problems Ε-net Time complexity Set cover problem Theoretical computer science Applied mathematics Computational complexity theory
329	Sage Reference Manual: Games Release 6.7 The Sage Development Team June 24, 2015 Add to Reading List Source URL: doc.sagemath.org Language: English - Date: 2015-06-24 05:21:38 Search algorithms Applied mathematics Recreational mathematics Puzzle video games Dancing Links Backtracking Exact cover Puzzle Sudoku algorithms Mathematics Sudoku NP-complete problems
330	LNCSCircle of Friend Query in Geo-Social Networks Add to Reading List Source URL: www.cse.unt.edu Language: English - Date: 2013-08-12 15:35:49 Search algorithms Approximation algorithms Mathematical optimization NP-complete problems Analysis of algorithms Nearest neighbor search Clique problem K-nearest neighbor algorithm Time complexity Theoretical computer science Mathematics Applied mathematics

UPDATE